Compositional analysis for verification of parameterized systems
نویسندگان
چکیده
منابع مشابه
Compositional Analysis for Verification of Parameterized Systems
Many safety-critical systems that have been considered by the verification community are parameterized by the number of concurrent components in the system, and hence describe an infinite family of systems. Traditional model checking techniques can only be used to verify specific instances of this family. In this paper, we present a technique based on compositional model checking and program an...
متن کاملCompositional Verification of Timed Systems
In this paper we address the state space explosion problem inherent to model-checking timed systems with a large number of components. The main challenge is to obtain pertinent global timing constraints from the timings in the components alone. To this end, we make use of auxiliary clocks to automatically generate new invariants which capture the constraints induced by the synchronisations betw...
متن کاملCompositional Verification without Compositional Specification for Learning-Based Systems
We consider the problem of performing compositional verification of a system with machine learning components whose behavior cannot easily be formally specified. We present an approach involving a system-level verifier communicating with a component-level analyzer wherein the former identifies a subset of environment behaviors that might lead to a system-level failure while the latter identifie...
متن کاملMicroprocessor Hazard Analysis Via Formal Verification of Parameterized Systems
HADES1 is a fully automated verification tool for pipeline-based microprocessors that aims at flaws caused by improperly handled data hazards. It focuses on single-pipeline microprocessors designed at the register transfer level (RTL) and deals with read-after-write, write-after-write, and write-afterread hazards. HADES combines several techniques, including data-flow analysis, error pattern ma...
متن کاملApproximated Context-Sensitive Analysis for Parameterized Verification
We propose a verification method for parameterized systems with global conditions. The method is based on context-sensitive constraints, a symbolic representation of infinite sets of configurations defined on top of words over a finite alphabet. We first define contextsensitive constraints for an exact symbolic backward analysis of parameterized systems with global conditions. Since the model i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2006
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2005.11.016